Перевод: с русского на все языки

со всех языков на русский

path constraint

См. также в других словарях:

  • Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

  • Constraint-based Routing Label Distribution Protocol — (CR LDP) is a control protocol used in some computer networks. As of February 2003, the IETF MPLS working group deprecated CR LDP and decided to focus purely on RSVP TE. It is an extension of the Label Distribution Protocol (LDP), one of the… …   Wikipedia

  • Path 15 — is the name of a major north south power transmission corridor in California. It forms a part of the Pacific AC Intertie and the California Oregon Transmission Project. Path 15, along with the Pacific DC Intertie running far to the east, forms an …   Wikipedia

  • Path computation element — Routing is the process of finding a suitable route for conveying data between a source and one or a set of destination. Routing can be subject to a set of constraints, like QoS, policy, or price. Constraint based path computation is a strategic… …   Wikipedia

  • Constraint Based Routing — Constrained Shortest Path First (CSPF) ist eine Erweiterung für Kürzester Pfad Algorithmen. Der von CSPF berechnete kürzeste Pfad erfüllt zusätzliche Nebenbedingungen. Dies bedeutet, dass der Kürzeste Pfad Algorithmus berechnet wird, nachdem die… …   Deutsch Wikipedia

  • Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …   Wikipedia

  • Constrained Shortest Path First — (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of… …   Wikipedia

  • Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

  • Certification path validation algorithm — The certification path validation algorithm is the algorithm which verifies that a given certificate path is valid under a given public key infrastructure (PKI). A path starts with the Subject certificate and proceeds through a number of… …   Wikipedia

  • Gauss' principle of least constraint — The principle of least constraint is another formulation of classical mechanics enunciated by Carl Friedrich Gauss in 1829.The principle of least constraint is a least squares principle stating that the true motion of a mechanical system of N… …   Wikipedia

  • Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»